Notes on Predicate Calculus and Logic Programming
ثبت نشده
چکیده
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, 1987. [5] Manna, Z.: Mathematical Theory of Computation, McGraw-Hill, 1974. [6] Mendelson, E.: Introduction to Mathematical Logic, 3rd Edition, Wadsworth & Brooks/Cole Advanced Books & Software, Monterey, California. 1987.
منابع مشابه
A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation
Bellin, G. and J. Ketonen, A decision procedure revisited: Notes on direct logic, linear logic and its implementation, Theoretical Computer Science 95 (1992) 115-142. This paper studies decidable fragments of predicate calculus. We will focus on the structure of direct predicate calculus as defined in Ketonen and Weyhrauch (1984) in the light of the recent work of Girard (Girard 1987, 1988) on ...
متن کاملDenotational Completeness Revisited
We deene a notion of Kripke logical predicate for models of classical linear logic. A Kripke logical predicate on a type A will be a set of generalised elements of A satisfying certain closure properties. Denotations of proofs of A will be characterised as those global elements of A satisfying all Kripke logical predicates on A.
متن کاملReasoning about efficiency within a probabilistic µ-calculus
Expectation-based probabilistic predicate transformers 15] provide a logic for probabilistic sequential programs, giving access to expressions such as`the probability that predicate A is achieved nally'. Using expectations more generally however, we can express-calculus formulae for the expected path-length of a computation tree. Moreover within an expectation-based-calculus such eeciency measu...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملProof Search and Counter Model of Positive Minimal Predicate Logic
This paper presents an algorithm of proof search for positive formulas in minimal predicate logic. It is based on the LJB deduction system introduced in[2]. The algorithm returns a deduction tree, and hence a proof, when the formula is provable, and a counter-model will be constructed when the formula is unprovable. The soundness and the completeness are proved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007